Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
نویسندگان
چکیده
Let T be an n-node tree of maximum degree 4, and let P be a set of n points in the plane with no two points on the same horizontal or vertical line. It is an open question whether T always has a planar drawing on P such that each edge is drawn as an orthogonal path with one bend (an “L-shaped” edge). By giving new methods for drawing trees, we improve the bounds on the size of the point set P for which such drawings are possible to: O(n) for maximum degree 4 trees; O(n) for maximum degree 3 (binary) trees; and O(n) for perfect binary trees. Drawing ordered trees with L-shaped edges is harder—we give an example that cannot be done and a bound of O(n logn) points for L-shaped drawings of ordered caterpillars, which contrasts with the known linear bound for unordered caterpillars.
منابع مشابه
Orthogeodesic Point-Set Embedding of Trees
Let S be a set of N grid points in the plane, and let G a graph with n vertices (n ≤ N). An orthogeodesic point-set embedding of G on S is a drawing of G such that each vertex is drawn as a point of S and each edge is a chain of horizontal and vertical segments with bends on grid points whose length is equal to the Manhattan distance of its end vertices. We study the following problem. Given a ...
متن کاملThe Minimum Bends in a Polyline Drawing with Fixed Vertex Locations
We consider embeddings of planar graphs in R where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar graph. It has long been known that even when the vertex locations are completely fixed, a planar graph admits a polyline drawing where edges bend a total of O(n...
متن کاملPERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملTree Drawings on the Hexagonal Grid
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of directions used for the edges from each node to its children from one to five, and to five patterns: straight, Y , ψ, X, and full. The ψ–drawings generalize hvor strictly upward drawings to ternary trees. We show that co...
متن کاملOn two lower bound constructions
We address two problems. In the first, we refine the analysis of a lower bound construction of a point set having many non-crossing spanning trees. We also give more precise upper bounds on the maximum number of non-crossing spanning trees, perfect matchings and simple polygons of a planar point set. In the second, we give an improved lower bound construction for the d-interval problem. 1 Non-c...
متن کامل